Set-Based Particle Swarm Optimisation: A Review

نویسندگان

چکیده

The set-based particle swarm optimisation algorithm is a swarm-based meta-heuristic that has gained popularity in recent years. In contrast to the original algorithm, used solve discrete and combinatorial problems. main objective of this paper review provide an overview problems which been applied. This starts with examination previous attempts create discusses shortcomings existing attempts. established as only suitable variant both based on true set theory does not require problem-specific modifications. In-depth explanations are given regarding general position velocity update equations, mechanisms control exploration–exploitation trade-off, quantifiers diversity. After various applications presented, concludes discussion potential future research.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric Particle Swarm Optimisation

Using a geometric framework for the interpretation of crossover of recent introduction, we show an intimate connection between particle swarm optimization (PSO) and evolutionary algorithms. This connection enables us to generalize PSO to virtually any solution representation in a natural and straightforward way. We demonstrate this for the cases of Euclidean, Manhattan and Hamming spaces.

متن کامل

Perceptive Particle Swarm Optimisation

Conventional particle swarm optimisation relies on exchanging information through social interaction among individuals. However for real-world problems involving control of physical agents (i.e., robot control), such detailed social interaction is not always possible. In this study, we propose the Perceptive Particle Swarm Optimisation algorithm, in which both social interaction and environment...

متن کامل

Standard Particle Swarm Optimisation

Since 2006, three successive standard PSO versions have been put on line on the Particle Swarm Central [10], namely SPSO 2006, 2007, and 2011. The basic principles of all three versions can be informally described the same way, and in general, this statement holds for almost all PSO variants. However, the exact formulae are slightly di erent, because they took advantage of latest theoretical an...

متن کامل

A Dimension Reduction Approach to Classification Based on Particle Swarm Optimisation and Rough Set Theory

Dimension reduction aims to remove unnecessary attributes from datasets to overcome the problem of “the curse of dimensionality”, which is an obstacle in classification. Based on the analysis of the limitations of the standard rough set theory, we propose a new dimension reduction approach based on binary particle swarm optimisation (BPSO) and probabilistic rough set theory. The new approach in...

متن کامل

Beyond Standard Particle Swarm Optimisation

Currently, two very similar versions of PSO are available that could be called “standard”. While it is easy to merge them, their common drawbacks still remain. Therefore, in this paper, the author goes beyond simple merging by suggesting simple yet robust changes and solving a few well-known, common problems, while retaining the classical structure. The results can be proposed to the “swarmer c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2023

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math11132980